Signaling framework for negotiating and executing composition of registries

ABSTRACT

Systems, methods, devices and software for negotiating and executing registry composition are described. Signaling frameworks for both of these aspects of registry composition are provided.

TECHNICAL FIELD

The present invention relates generally to automatic composition ofnetworks and, more particularly, to methods, systems, devices andsoftware for performing signaling associated with composing registriesand other information associated with network composition.

BACKGROUND

In the near future, consumers are expected to carry multiple devicesthat communicate with one another to form small, personal area networks(PANs) that move with the user. In a given area, there may be manyusers, each with his/her own PAN. The PANs of different users are likelyto comprise different devices, use different technologies, and havedifferent resources and capabilities. It would benefit users to make theresources and capabilities of one PAN available to other PANs. Forexample, one PAN may have Internet access that can be shared with otherPANs.

Network interworking allows the sharing of resources between networks sothat users in one network can have access to resources in anothernetwork. BLUETOOTH and IEEE 802.15 both allow interworking between PANs.However, such interworking typically requires manual configuration andoff-line negotiation.

The concept of network composition is gaining acceptance as a viabletechnique for the seamless and automatic creation of ad-hoc networkswithout user intervention. Automatic network composition enablesinterworking between networks “on the fly” in a manner that istransparent to the user. For example, the Ambient Networks Project iscurrently developing standards for networks called Ambient Networks. AnAmbient Network (AN) can be defined as one or more network nodes and/ordevices that share a common network control plane called the AmbientControl Space (ACS). The ACS contains all of the network control andmanagement functions, which are organized into functional areas (FAs).Each FA represents a different management task (e.g., QoS, mobility,composition, security, congestion control, etc.). The ACS includes twointerfaces: the Ambient Network Interface (ANI) and the Ambient ServiceInterface (ASI). The ANI enables communication between different AmbientNetworks, and the ASI allows access to the services offered by theAmbient Network. The ACS enables automatic composition of networks in atransparent fashion, without manual configuration and off-linenegotiation, while taking into account user needs, preferences,locations, and devices.

ANs can host several registries. A registry is any authoritative storeof information or repository of data. Examples include ManagementInformation Bases (MIB), relational databases and Context InformationBases (CIB). When ANs compose, the hosted registries need to compose.Registry composition is a sub-process of network composition andprovides seamless, autonomous and uniform access to the updated contentof all of the registries in the composed network. There are severalreasons for performing registry composition. A first reason is that theregistries' content may need to compose. Indeed, when ANs compose, thecontent of the hosted registries may be kept as it is; modified or evenmerged. Content merging can happen for instance when a new service isproposed by the composed network, by combining elementary servicesprovided by the composing networks. A second reason for performingregistry composition is that entities in the composed network may needaccess to a content hosted by a registry that was in a different networkbefore composition. The interface of such a registry (e.g. SNMP, SQL)may be different from the one used by the interested entity. Thegranularity and the format of the registry content may also be differentfrom those supported by the interested entity. A third reason forperforming registry composition is that new registries may need to becreated in order to store the composed content.

The registries to compose may be heterogeneous. They may be of differenttypes (e.g. centralized, distributed), they may store heterogeneoustypes of information (e.g., raw data vs. aggregated data) that ispresented using different formats (e.g., object oriented database,relational database), and they may rely on different interfaces toaccess the stored information. An interface is either a protocol (e.g.P2P information discovery protocols) or an Application ProgrammingInterface (e.g. UDDI APIs). Registry composition is orchestrated by theRegistry Composition Entity (RCE) and can be performed in two mainsteps, e.g., negotiation of the composition agreement and execution ofthe agreement.

Registry composition requires dynamic coordination between the controlfunctional entities of the composing networks because these entitiesneed to communicate in order to coordinate and regulate the composition.In order to perform registry composition, a signaling framework isneeded.

Various signaling frameworks are available for other types ofcommunication systems. For example, Resource ReSer-Vation Protocol(RSVP) is a resource reservation protocol, for simplex, multicast andunicast data flows. In RSVP, the signaling sessions are defined by theIP addresses of the source and the destination, which prevents RSVP fromsupporting session mobility. Furthermore, RSVP does not support symbolicnames and the signaling is flow dependent. This signaling framework alsopresents a tight coupling between the signaling semantic (i.e.,resources reservation) and the delivery of the signaling messages, whichmay be undesirable for registry composition.

Session Initiation Protocol (SIP) and H.323 are signaling frameworksassociated with call control. SIP is an IETF standard and H.323 is a setof specifications from ITUT. However, SIP is a point-to-point protocolwhich does not separate the semantic of the signaling application fromthe message delivery. SIP is also not designed for negotiation and itdoes not support session mobility. Indeed, if the destination addresschanges during the same SIP session, there is no way to deal with thischange and an error message ‘destination unreachable’ is sent to theentity trying to contact the entity whose address has been changed.H.323 also does not separate transport and signaling functionalities,and it supports neither session mobility nor symbolic names.

Other signaling frameworks include Cross Application Signaling Protocol(CASP), Next Step In Signaling (NSIS) and Generic Ambient NetworkSignaling (GANS). CASP is a general-purpose signaling protocol suite,which is employed to establish a control state about data flow along itspath in the network. This signaling framework addresses the sessionmobility problem by introducing the concept of a location-independentsession identifier. CASP reuses the existing transport and securityprotocols and decouples message transport from the next signaling hopdiscovery. NSIS re-uses many CASP concepts, e.g., it is modular,flexible and supports different applications. Furthermore, NSIS enablessignaling across different network environments, can be used indifferent parts of the Internet (e.g., at the edge, in the core, etc.)and supports mobility by allowing efficient service re-establishmentafter handover. Examples of NSIS-based signaling protocols are theextended RSVP QoS signaling protocol and the middlebox configurationprotocol.

GANS is a back-ward compatible generalization of NSIS with extensionsincluding the support of symbolic, names and session mobility and flowindependent signaling applications. Signaling applications can addressdestinations using symbolic names, which are translated by GANS'trans-port layer into corresponding IP addresses. A mechanism isprovided to allow dynamic update of the IP-Symbolic name binding.However, CASP and NSIS do not support both flow-dependent andflow-independent signaling applications, since they only define flowdependent signaling. Moreover, these signaling frameworks do not supportsymbolic names and, along with GANS, they support only one-to-onecommunication. Therefore, none of these signaling frameworks CASP, NSISand GANS are independent of the negotiation model. Furthermore, none ofthese frameworks provide a signaling application that can be used forregistry composition (i.e., none of the designed signaling applicationsdeal with the registry composition specifics).

Accordingly, it would be desirable to provide new signaling frameworks,methods, systems, devices and software associated with networkcomposition.

SUMMARY

According to an exemplary embodiment, a method for executing anegotiated registry composition agreement includes the steps ofreceiving a first message at an overlay node to activate the overlaynode, the first message including a list of at least one registry thatsupports an interface being used by the overlay node, and sending, fromthe overlay node, a second message toward a re-director module of eachof the at least one registry in the list.

According to another exemplary embodiment, a method for negotiatingregistry composition includes the steps of sending, from a mediatornode, an offer to compose registries to at least two participant nodes,and terminating, by the mediator node, participation in the negotiationprior to reaching registry composition agreement.

According to yet another exemplary embodiment, a communication nodeincludes a processor for executing a negotiated registry compositionagreement by receiving a first message to activate an overlay node, thefirst message including a list of at least one registry that supports aninterface being used by the overlay node, and by sending a secondmessage toward a re-director module of each of the at least one registryin the list.

According to still another exemplary embodiment, a communication nodewhich operates as a mediator for negotiating registry compositionincludes a processor for sending an offer to compose registries to atleast two participant nodes, and which subsequently decides to terminateits participation in the negotiation prior to reaching a registrycomposition agreement.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and constitute apart of the specification, illustrate one or more embodiments and,together with the description, explain these embodiments. In thedrawings:

FIG. 1 illustrates a composable network according to one exemplaryembodiment;

FIG. 2( a) illustrates signaling associated with negotiating networkcomposition according to an exemplary embodiment;

FIG. 2( b) illustrates a mediator overlay according to an exemplaryembodiment;

FIG. 3( a) depicts a signaling architecture according to an exemplaryembodiment;

FIG. 3( b) shows the signaling architecture of FIG. 3( a) operating toconvey messages between two applications or nodes;

FIG. 4 is a flowchart depicting a method for sending a message using asignaling layer and a messaging layer according to an exemplaryembodiment;

FIG. 5 illustrates an overlay node according to an exemplary embodiment;

FIG. 6 is a signaling diagram associated with executing a negotiationagreement to create an overlay network according to an exemplaryembodiment;

FIG. 7 illustrates an exemplary set of pre-composition networks used invarious simulations associated with the exemplary embodiments;

FIGS. 8 and 9 illustrate simulation results associated with registrycomposition negotiations using variations of the pre-compositionnetworks of FIG. 7;

FIG. 10 illustrates an exemplary composed network used in varioussimulations associated with the exemplary embodiments;

FIGS. 11-14 illustrate simulation results associated with registrycomposition execution using variations of the composed network of FIG.10;

FIG. 15 illustrates an exemplary node associated with exemplaryembodiments; and

FIGS. 16 and 17 are flowcharts illustrating exemplary methods accordingto exemplary embodiments.

DETAILED DESCRIPTION

Network composition enables “on the fly” interworking betweenheterogeneous networks without manual configuration or prior offlinenegotiation. Network composition results in the creation of a new postcomposition network, referred to herein as the composed network, inwhich resources of the pre-composition networks may be shared. Asmentioned above, when networks compose, the hosted registries have tofollow suit and compose as well. This requires dynamic coordinationbetween the control functional entities of the composing networksbecause these entities need to communicate in order to coordinate andregulate the composition. Thus, the provision of a signaling frameworkwhich facilitates such communications to an Ambient Network architecturewould be desirable.

Prior to discussing signaling frameworks according to these exemplaryembodiments, an exemplary composable network in which such signalingframeworks can be employed will be described to provide some context.FIG. 1 illustrates a composable network 10 (e.g., an Ambient Network)according to one exemplary embodiment. The composable network 10 shownin FIG. 1 is based on the Ambient Network architecture proposed by theAmbient Network Project as described in “Ambient Networking: Conceptsand Architecture (IST-2002-2.3.1.4), which is incorporated herein byreference. The network 10 may comprise one or more network nodes 22 thatreside in the connectivity layer 12 of the network 10 and share a commonnetwork control space 14. The connectivity layer 12 comprises thelogical and physical resources of the network 10, which may include oneor more registries 24. There is one common network control space 14 forall of the nodes 22 in the network 10. The network control space 14 islogically present in the nodes 22. This network architecture does notimply a particular kind of implementation. For example, the networkcontrol space 14 can be implemented on a central server or in adistributed fashion where nodes 22 implement parts of the networkcontrol space 14.

The network control space 14 comprises a set of control functions toenable interworking between networks 10. These control functions, alsoreferred to as functional areas (FAs), each handle a specific managementtask, such as Quality of Service (QoS), mobility, security, contextawareness, and network composition. The composition FA is responsiblefor composition related functions as will be hereinafter described.Depending on the type of composition, a new network control space 14 maybe created for the composed network.

The network control space 14 includes three interfaces: the networkinterface 16, the service interface 18, and the resource interface 20.The network interface 16 provides a standard mechanism to enablecooperation between the network control spaces 14 of different networks10 and hides the complexities of the underlying network technologies sothat networks 10 using different technologies appear the same. Thenetworks use a technology independent signaling protocol, such as theGeneric Ambient Network Signaling Protocol (GANS), to exchangeinformation over the network interface 16. Applications or clientsresiding on network nodes 22 use the service interface 18 to access theservices provided by the network control space 12. When two networks 10compose, a single service interface 18 is created for the composednetwork. The resource interface 20 provides a mechanism to manage theresources residing in the connectivity layer. Applications use theresource interface (indirectly) to access the resources residing onnetwork nodes 22 in the connectivity layer 14.

Individual networks 10 can compose to form composed networks, which canalso compose with other networks 10. Network composition enables dynamicand instantaneous interworking of heterogeneous networks 10 on demandand in a transparent fashion without manual configuration or offlinenegotiation. When two networks 10 compose, they communicate with oneanother over the network interface 16 to negotiate a network compositionagreement (NCA). The NCA specifies the resources that will be shared,the services that will be provided, and the policies that will beimplemented to coordinate interoperation of the network control spaces14 of the pre-composition networks 10. The result of the composition maybe a newly composed network that includes all of the logical andphysical resources contributed by the pre-composition networks 10.Composition, however, does not necessarily result in a new composednetwork.

Network composition is a significant feature of ANs which overcomes thelimitations of today's static network cooperation, by providing dynamiccooperation between heterogeneous networks, on-demand. Indeed, today'snetwork cooperation relies on off-line agreements and manualconfiguration operations, and enables access to a very limited set ofservices (i.e. those identified in the agreement). Network compositionallows on-line agreement creation, and seamless and instantaneous accessto new services. The cooperation process via network composition istransparent to the end users, but takes user context and network contextinto account.

Three types of network composition can, for example, be performed:network interworking, control sharing, and network integration. In thefirst type, each network 10 controls and manages its own resources andno composed network is created. In the second type, some of theresources of the composing networks 10 are contributed to a new composednetwork. This composed network has its own logical network controlspace. The composing networks 10 exercise joint control over the sharedresources and keep control over the remainder of their own resources. Inthe third type of network composition, all of the participating networks10 merge into a new composed network. The composed network thus includesall of the logical and physical resources in the composing networks. Anew logical network control space 14 is created during composition andmanages the composed network.

The pre-composition networks 10 may include registries 24 that can beaccessed by applications. A registry 24 is any authoritative store ofinformation or repository of data, such as a database. The registries 24hosted by the pre-composition networks 10 can be of different types(e.g., centralized, distributed), they can store different types ofinformation using different formats (e.g., object oriented database,relational database), and they can rely on different interfaces toaccess the stored information (i.e., protocols such as P2P informationdiscovery protocols or programming interfaces such as UDDI APIs). Theregistries 24 may also have redirectors associated therewith forredirecting certain requests for information as will be described inmore detail below.

According to the present invention, the concept of composition isextended beyond simple network composition to include composition ofregistries 24 existing in the pre-composition networks 10. When twonetworks 10 compose, two or more individual registries 24 in theconstituent networks 10 are merged into a single logical registry,referred to herein as a merged registry. As used herein, the term“merge” does not necessarily imply the physical merging of theregistries 24, but also includes the logical linking of registries 24 sothat the combined resources appear to an application in the composednetwork as a single registry 24. Clients are provided the ability toautomatically and seamlessly access the content of the various postcomposition registries that comprise the merged registry 26. Thisobjective can be achieved by providing an overlay architecture forinformation discovery and publication after network composition. Moreinformation regarding registry composition and overlay networks can befound in, for example, U.S. patent application Ser. No. 11/614,808,entitled “Architecture for an Automatic Composition of Registries WhenNetworks Compose”, filed on Dec. 21, 2006, and published as U.S. PatentPublication No. 2008-0133727, the disclosure of which is incorporatedhere by reference.

Briefly, an exemplary negotiation protocol associated with registrycomposition can have three entity roles: i.e., the initiator, theresponder and the mediator. The initiator is the entity that initiatesthe negotiation. The responder is the entity that receives an agreementproposal and decides on its acceptance. In some cases, e.g.,point-to-multipoint, there may be multiple responder entities.Collectively, the initiator and responder entities are also referred toherein as “participants”. The mediator orchestrates the negotiation andcreates the proposals. The negotiation protocol according to exemplaryembodiments defines four types of requests (i.e., Initiate, Ack, Offer,and Bye) and one response type (i.e. Ok). Each response includes aresponse code that specifies the type of the response (i.e. Accept,Reject, Agreement, and Error).

To start a negotiation session, the initiator 30 sends an Initiatemessage to the mediator 32, along with the list of participants withwhich it wants to negotiate as shown in FIG. 2( a). If the mediator 32agrees to arbitrate the new session, it sends an Initiate message to allof the participants 34 in the list and sends an acknowledgementaccepting the role of mediator back to the Initiator 30. The responders34 may either accept or reject the negotiation. If the negotiation isaccepted, as shown in FIG. 2, the mediator 32 creates a proposal, sendsit to all of the participants 30, 34 using the Offer message and thenanalyses their responses. If the proposal is rejected, the mediator 32creates a new proposal and restarts the process. This is repeated untilan agreement is reached, an error is encountered or the negotiationtimeout expires. Then, the mediator 32 creates the final response (e.g.Ok: Error or Ok: Agreement) and sends it to the participants 30, 34.

After the negotiation is started, an entity may need to leave thenegotiation (e.g., if the network to which it belongs moves away fromthe other networks). Accordingly, the negotiation protocol according tothese exemplary embodiments enables entities (i.e., a participant 30, 34or a mediator 32) to quit the negotiation. When a participant 30, 34decides to quit, it sends a Bye message to the mediator 32. The mediator32 will either continue the negotiation with the remaining participantsor end the negotiation, depending on the negotiation policies (e.g., thenegotiation is ended if only one participant 30, 34 remains in thenegotiation). If the mediator 32 decides to quit, it sends a Bye messageto all of the participants 30, 34, which results in the termination ofthe negotiation process.

According to exemplary embodiments, the negotiation protocol is furtherextended to enable the negotiation to continue even if the mediator 32that orchestrates the negotiation quits. Two cases are consideredherein: voluntary and forced departure. Voluntary departure occurs whenthe mediator 32 decides to leave the negotiation (e.g., if the networkto which it belongs moved away from the other networks). Forceddeparture occurs when the mediator 32 is forced to disconnect from thenetwork (e.g., node failure, connectivity problems, etc.). Startingfirst with voluntary departure, if an active mediator 32 (i.e., themediator that is orchestrating an ongoing negotiation) decides to quit,it should insure that the negotiation process will continue among theremaining participants. Therefore, the mediator 32 which intends tovoluntarily depart the negotiation should find another mediator 32 thatcan replace it. This can, for example, be accomplished as follows.

Each mediator 32 is responsible for keeping track of the other mediators32 in the network. When a mediator 32 joins the network, it publishesitself to the network members. This can be done using any desiredinformation publication protocol (e.g. PDP). When a mediator 32 receivesa publication message from another mediator 32, the mediator 32receiving the publication message then establishes a connection with thenewly joined mediator 32. This results in the creation of an overlaynetwork between all of the mediators in the network as shown in FIG. 2(b).

When an active mediator 32 decides to quit a negotiation, it sends a Byemessage to one of its neighboring mediators 32, along with the currentstatus of the negotiation and its related information. If no othermediator 32 is part of the network, the mediator 32 sends a Bye messageto all of the participants 30, 35, which will terminate the negotiationprocess. According to one exemplary embodiment, the mediator 32 cannotquit the negotiation if it is waiting for a message from one or moreparticipants. Indeed, if this is allowed, the expected message will belost, and the status transferred to the new mediator 32 will becorrupted. Therefore, the mediator 32 should quit only when it is in astable state (i.e., no expected incoming message is missing). Theparticipants 30, 34 will get the address of the new mediator 32 in thenext message they receive.

To address forced departures of a mediator 32 according to an exemplaryembodiment, each active mediator 32 can choose one of its neighboringmediators 32, e.g., randomly, as its backup. Assuming that theprobability that both an active mediator 32 and its backup leave thenetwork at the same time is very low, a single backup mediator 32 may besufficient. Alternatively, multiple backups could be selected by eachactive mediator 32. According to this exemplary embodiment, eachmediator 32 facilitates detection of the forced departure of the othermediators 32 which it is backing up by periodic heartbeat messages. Morespecifically, and according to one purely illustrative exemplaryembodiment, the scheme proposed in Chunyan Fu, Roch Glitho, and FerhatKhendek, A Novel Session Recovery Mechanism for Cluster-based SignalingArchitecture for Conferencing in MANETs, In the Workshop on Wireless Adhoc and Sensor Networks (WWASN 2007), June 25, Toronto, the disclosureof which is incorporated here by reference, can be used to detectheartbeats for insertion of backup mediators into a negotiation process.

Therein, a session recovery mechanism is proposed for cluster-basedsignaling architecture for conferencing in MANET. The conferenceparticipants are organized in different clusters, and each cluster has asuper-member that is responsible for detecting the forced departure ofthe members of its cluster and the other super-members. To reach thisgoal, each super-member maintains a heartbeat session with each memberof its cluster and with each of the other super-members. A session isdefined as a signaling link between two nodes and heartbeat is definedas a periodic exchange of a request and a reply. According to thepresent exemplary embodiment, the super-member is the mediator 32, andthe members are the participants 30, 35. The session is a link between amediator 32 and a participant 30, 34 or between two mediators 32.

The backup mediator 32 periodically sends a heartbeat request to theactive mediator 32 and starts a timer. If the timer fires and no replyis received, the backup mediator 32 re-sends the request and restartsthe timer. If there is still no reply upon a predetermined number ofrequests, e.g., 1, 2, 3 or 4, the backup mediator 32 decides that theactive mediator 32 has unintentionally departed and takes over the roleof active mediator for that negotiation. If a backup mediator 32 is nolonger reachable, the active mediator 32 to which it is assigned choosesa new backup. If the active mediator 32 disappears, its backup willdetect its forced departure using the heartbeat scheme, and willcontinue its ongoing negotiation sessions.

According to exemplary embodiments, a signaling framework can beprovided to facilitate the signaling illustrated in FIG. 2( a) anddescribed above with respect to mediator departure and FIG. 2( b). Sucha signaling framework according to these exemplary embodiments isintended to have various characteristics. First, the signaling frameworkshould support the negotiation and execution of the compositionagreement, for registry composition. Second, it should support symbolicnames and session mobility, not rely on a permanent central entity andbe lightweight. Indeed, in ANs, entities may leave and join the networkat any time, using the same or a different IP address and port number,and they may use symbolic names to address destination entities.Furthermore, an AN can include different types of de-vices, withheterogeneous capabilities. Therefore, the signaling framework should belightweight in order to be used by any of theses devices (e.g. includingdevices with limited resources). Third, the signaling framework shouldbe independent of the negotiation model, i.e., it should supportnegotiation with or without mediator, support different decision modelsfor the negotiation (e.g. Accept-it-or-leave-it, offer/counteroffer) andsupport different negotiation approaches. Negotiation can be eitherone-to-one (i.e. between two entities) or one-to-many (i.e. one entitycommunicating with more than one entity at the same time) ormany-to-many. Therefore, to be independent of the negotiation model, theframework should also allow point-to-point and point-to-multipointmessage delivery. Point-to-point message delivery is used for one-to-onenegotiation. Point-to-multipoint is used for one-to-many andmany-to-many negotiation. Negotiation approaches include parallelnegotiation, sequential negotiation and hybrid-negotiation. Theseapproaches are defined when the negotiating parties are negotiatingmultiple issues and correspond to, for example, negotiating partiespresenting all their demands/offers at once, one by one, and group bygroup, respectively.

Fourth, the signaling framework should allow ex-change of thenegotiation agreements and proposals. Fifth, it should be modular andextensible. Sixth it should separate the semantic of the signalingapplication (i.e. registry composition) from the message delivery, sothat it can be easily extensible. Seventh, it should enable the usage ofexisting and standard transport protocols (e.g., TCP, UDP), fortransporting signaling messages. Eighth, it should supportflow-dependent signaling applications, where the signaling messagesfollow the flow data path, and flow-independent signaling applications(e.g. network composition). However, those skilled in the art willappreciate that exemplary signaling frameworks according to theseexemplary embodiments may exhibit all, or only a subset, of these eightcharacteristics.

To provide these capabilities, signaling frameworks according to theseexemplary embodiments are architected as backward compatible, extendedversions of the IETF NSIS (Next Step in Signaling), for which theunextended version is described in the article “Next Step in Signaling(NSIS): Framework, RFC 4080, June 2005, the disclosure of which isincorporated here by reference. More specifically, exemplary embodimentsdescribed below provide two types of extensions to the NSIS framework: amessaging layer extension and a Signaling Application for RegistryComposition (SARC). Briefly, the messaging layer extension is providedto support flow independent applications, support symbolic names andprovide a group management solution to allow point-to-multipoint messagedelivery. SARC supports signaling associated with different negotiationmodels for registry compositions. Each of these extensions will now bedescribed in more detail as part of the discussion of an overall,exemplary signaling architecture illustrated as FIG. 3( a).

The architectural design of these exemplary signaling frameworks isbased on two layers shown in FIG. 3( a): the signaling layer 40 and thecommon layer 42. The signaling layer 40 includes the SARC application44, which is of particular interest for this discussion, but can alsoinclude any GANS, NSIS or other signaling application 46, 48. The commonlayer 42 provides functionalities that are common to all of thesignaling applications 44, 46 and 48, e.g., message transportation fromone node to another. Thus, the common layer 42 includes a transportlayer 50, including transport layer security (TLS) and IP layersecurity, which is responsible for transporting negotiation messages anda messaging layer (ML) 52 that executes common functions before sendingthe message to its destination. The messaging layer 52 according to thisexemplary embodiment uses existing standardized transport protocols(e.g., TCP, UDP), provided by the transport layer 50, to transmitsignaling messages, such as those illustrated in FIG. 2( a). The commonlayer 42 sits between the signaling layer 40 and lower layers, e.g., theIP layer 51.

The messaging layer 52 comprises two main building blocks:Negotiation-EGIST (N-EGIST) function 54 and Group Management (GM)function 56. N-EGIST function 54 is an extension of the GANS' EGISTfunction. The GANS' EGIST function provides for support offlow-independent applications and symbolic names. To extend thisfunctionality, the N-EGIST function 54 according to this exemplaryembodiment also includes: (1) support of point-to-multipoint signaling,(2) group management, e.g., group members can be identified by their IPaddresses and/or symbolic names, (3) interaction between signalingapplications 44, 46 and 48 and GM function 56, (4) storage andmaintenance of the name binding state, without modifying the routingstate information used by EGIST for routing messages towards the groupmembers, and (5) extension of EGIST APIs to handle point-to-multipointmessage delivery, which features are not found in EGIST functionsdescribed in the GANS framework.

Regarding this latter point, i.e., extension of EGIST APIs, several newparameters associated with EGIST primitives are provided in N-EGISTfunction 54 to support signaling associated with the aforedescribednegotiations. For example, the SendMessage primitive is used bysignaling applications 44, 46 and 48 to send a message to one or moredestinations. According to these exemplary embodiments, it has two newparameters: group_id and min_resp. The Group_id parameter identifies thegroup to which the message should be sent. The Min_resp parameter is theminimum number of different responses that N-EGIST 54 must receivebefore responding to the application. The Timeout parameter, alreadydefined by GIST, is used as the length of time the N-EGIST layer canwait for min_resp responses.

As another example, the RecvMessage primitive is used by N-EGISTfunction 54 to transmit received messages to signaling applications 44,46, and 48. In the case of a response, N-EGIST function 54 verifieswhether that response this belongs to an application that requires acertain number (i.e., the value of the min_resp parameter) of responses.If this is not the case, the response is directly transmitted to theapplication. Otherwise, N-EGIST function 54 waits until it receives theminimum number of required responses, or until the waiting timeoutexpires. Then, N-ESIST function 54 creates a list containing the numberof the responding parties along with their names and responses andpasses it to the signaling application 44, 46, 48.

The group management module 56 according to this exemplary embodimentprovides the signaling applications 44, 46, 48 with four APIs:

Create_group: creates a communication group, to enable communicationwith more than one destination (e.g. in case of one-to-manynegotiation). This API takes as a parameter the list of symbolic namesand/or IP addresses of the destination entities. At least one of thenames and IP parameters is not null for each group member. Each grouphas a unique identifier.

Add_member(group_id, name, ip): Adds a new member-identified by its nameor IP address- to a created group.

Remove_member(group_id, name, ip): removes the member identified by itsname or IP address from a given group.

Change_member_ip(name, ip): If a group member changes its IP address andthe application somehow becomes aware of the new address, it uses thisAPI to make necessary changes to the stored routing state.

To aid in group-related messaging, N-EGIST function 54 obtains the IPaddresses of the group members and sends the message to each of them.The addresses of the group members are stored in the routing state tablewhen the group is created. Destination Endpoint Exploration Protocol(DEEP) function 58 is used to obtain the IP address corresponding to agiven symbolic name. The E-GIST state maintenance function 57 storesrouting information such as mappings between symbolic names andassociated IP addresses. The N-EGIST routing state extension function 59extends the EGIST state maintenance function 57 to allow the storage andmaintenance of the routing information such as the list of members ofeach group along with their symbolic names and IP addresses.

Having now described various aspects of the common layer 42, thediscussion will now move on to the signaling layer 40 and, morespecifically, to exemplary embodiments of SARC 44. The primary functionof SARC 44 is to transfer different messages related to registrycomposition—encapsulated in SARC messages—between communicating peers.According to this exemplary embodiment, the architecture of SARC 44includes the definition of two entities: Requestor and Responder. TheRequestor is the entity that sends a request and the Responder is theentity that responds to the request. Next, exemplary details associatedwith SARC APIs, message types, formats, and end-to-end behavior will beprovided

Regarding APIs, SARC 44 provides the group management primitivesdescribed above, plus the following two interfaces. First, a SendMessageAPI is provided which can be used by negotiating entities to send amessage to peer entities. The primary parameters associate with this APIare the type and the payload of the message to send, min_resp, the ID ofthe destination group (for sending requests), the destination IP addressand name (for sending responses), the decision model to use for thenegotiation and the negotiation approach. Secondly, a RcvMessage API isprovided which can be used by SARC 44 to pass the content of a receivedmessage to the local negotiating entity. SARC messages according to thisexemplary embodiment include a common header, which indicates themessage type, followed by a body made up of a variable number ofType-Length-Value (TLV) objects. This structure makes them flexible andeasily expandable. SARC messages according to this exemplary embodimentare of two types: CANegotiation and CAExecution. CANegotiation messagesare used for composition agreement (CA) negotiation, whereas CAExecutionmessages are used for CA execution.

Each of the two message types has sub-types. These sub-types are asfollows:

CANegotiation sub-types: Initiate, Ok, Ack, Offer, and Bye.

CAExecution sub-types: ActivateNode, ConfigOv-Node, Join, and Quit.

Starting first with the CANegotiation sub-types, which are, for exampleillustrated in FIG. 2( a), the Initiate message can include, forexample, three TLV objects or fields: a local information object, aconditions object and negotiation model object. The local informationobject includes the information that is local for each network and whichis necessary for the creation of the agreement proposals. For example,this local information may include a list of registry informationobjects, where each registry information object describes a registry inthe composing network, e.g., including information such as the registrytype, Information Publication and Discovery Interface (IPDI) andaddress. The IPDI is a generic name which refers to different interfacetypes. This identifier is also used for directing/redirecting requests.For example, clients send requests to the registry which supports thesame IPDI as they do.

The conditions object includes the initiator conditions (if any)concerning the negotiation (e.g., an agreement is reached only if it isaccepted by all of the participants). The negotiation model objectincludes information about the negotiation model to use for a particularnegotiation which is being initiated by the message, e.g., thenegotiation approach and the decision model.

The Offer message can include, for example, two objects or fields: anoffer Identifier object and an offer data object. The offer identifierobject is a cryptographically random identifier chosen by the entitythat created the offer. The offer data object includes the offercontent, and it may be itself a set of TLV objects. Each Ok and Ackmessage carries a TLV INFO object, which contains a response code andthe corresponding object. The response codes according to this exemplaryembodiment are as follows:

0x1: Accept

0x2: Reject

0x3: Agreement

0x4: Error

Each of the Agreement and Error codes described above has acorresponding TLV object of the same name. The Agreement object includesthree fields: an agreement identifier field, an agreement data field andan agreement validity time. The first two objects are similar to theoffer identifier object and offer data object. The agreement validitytime specifies the time after which the agreement is no longer valid.Similarly, the Error object has an error data field, which includes theerror description. A message carrying a Reject code may transport areason object, which describes the reason of the rejection. A messagewith an Accept code may carry a local information object (e.g., when themessage is a response to an Initiate message, sent from a destinationparticipant to the mediator to accept the negotiation).

Turning next to the CAExecution sub-types, whose function is describedin more detail below with respect to FIGS. 5 and 6, the ActivateNodemessage carries the list of the one or more registries which support thesame IPDI as the message destination. Each registry is described using aRegistry Information object. ConfigOvNode also uses a RegistryInformation object to carry information about the overlay node (e.g.,its IP address). The Join and Quit messages carry a Registry Informationobject, describing the registry that wants to join or quit a composednetwork. If the Quit message is sent by an overlay node, it should alsoinclude the list of the registries that are served by the quitting node(i.e. the registries belonging to the multicast group maintained by thequitting overlay node).

FIG. 3( b) shows the architecture of FIG. 3( a) (referred to thereingenerally by reference numeral 300) at a higher level to performsignaling between a requester 302 and a responder 304 according toexemplary embodiments. The requester 302 generates a message which isprocessed in turn by SARC 44, messaging layer 52, and transport layer50. The message may be conveyed from the requestor node to the respondernode via an intervening network which may (or may not) use a differenttransport layer 306 than that provided by architecture 300. Theresponder 304 propagates the request message up through its architecture300, and returns a reply back along the reverse path as shown.

FIG. 4 is a flowchart which illustrates a method for a requestor 30 tosend a one-to-many (point-to-multipoint) message using theaforedescribed signaling framework and messaging formats according to anexemplary embodiment. Therein, the notation SARCi and MLi refers to thesignaling application 44 and the messaging layer 52 on the requesterside, respectively. At step 400, a requestor or initiator 30 (R_(i))decides to send a message. Then, a destination group (G_(i)) is createdat step 402, e.g., using the Create_group API of group management module56 described above. The requester then passes the message to be sent(m_(i)) to the SARC_(i) 44 using the SendMessage primitive describedabove at step 404. The SARC_(i) checks, at block 406, to see if themessage m_(i), to be sent is associated with an existing SARC session ornot. If so, then the flow moves directly to step 408 wherein theSARC_(i) 44 passes the message to the messaging layer 52. Otherwise, ifthere is no existing SARC session associated with this message to besent, one is first created at step 410. Similarly, at step 412, themessaging layer 52 checks to see if it has an existing sessionassociated with the message m_(i) which it has now received from theSARC_(i) 44. If so, then the flow follows the “Yes” branch to block 414,wherein the ML_(i) encapsulates the message m_(i) in an appropriatemessage layer message m2. Otherwise, the ML first creates a new MLsession for this message at step 416. The message layer 52 then obtainsthe members' addresses associated with group G_(i) from a state databaseat step 418 and uses that information to send the messages m2 to eachmember in the group at step 420. On the destination side, (not shown inFIG. 4), the counterpart ML 52 receives the message m2, records thestate information, processes the message (e.g., verifies if min_res isrequired), and passes the appropriate message to the Responder.

The registry composition process described above results in, forexample, the creation of an overlay network (i.e., a Registry OverlayNetwork) that provides the interested entities in the composed net-workwith uniform and seamless access to the content of all of the registriesin that network. The Registry Overlay Network (RON) includes a singleoverlay node for each Information Publication and Discovery Interface(IPDI) used by a registry in the composed network, and this overlay nodesupports that IPDI.

FIG. 5 depicts the architecture of an exemplary overlay node 500 whichcan be the result of a successful negotiation signaling process asdescribed above. The exemplary overlay node 500 includes a protocolslayer 502, a service layer 504 and an overlay application 506. Theprotocol layer 502 includes the IPDI 508 supported by the overlay node500 and the overlay protocol 510 used to communicate with the otheroverlay nodes. The service layer 504 includes two modules: IPD Service512 and Overlay Service 514. These modules 512 and 514 provide thenecessary functions to communicate with the actual registries 516 andthe other virtual nodes 518, respectively. The overlay application 520includes the necessary intelligence for information publication anddiscovery. Clients send their requests to the registry 516 that supportsthe same IPDI as they do. If the registry 516 has the requestedinformation (in case of discovery requests), the registry 516 respondsdirectly to the client. Otherwise, the registry 516 redirects therequest to the RON 500 (via re-director 522), which RON 500 identifiesthe registry 516 where the requested information is stored, retrievesthis information, and responds back to the client. The re-directormodule 522 can be added to the actual registry 516, in order to allowthe redirection of the client requests to the RON 500 as needed.

According to exemplary embodiments, each overlay node 500 is, e.g.,randomly, mapped to a registry 516 that supports the same IPDI using,for example, the CAExecution message sub-types described above. Anexemplary signaling diagram is illustrated in FIG. 6. To create the RON500, the RCE 600 responsible for the composition sends an ActivateNodemessage to the relevant overlay node 500 to activate it, along with thelist of the registries that support the same IPDI to which the overlaynode 500 is being mapped (the overlay node having been previouslyinstalled and awaiting activation). After an overlay node isinitialized, it sends a ConfigOvNode message to the re-director module516 of each registry 522 in its related list. This configures theaddress of the overlay node 500 to which requests should be re-directed.After the creation of the RON, another registry 516 may want to join(e.g., the registry 516 rejoins the composed network after having movedout of the coverage area for a while) or leaves the composed network(e.g., networks decompose). This is achieved by the respective registry516 sending a Join or Quit message to the overlay node 500 to which itwas (or is) connected, examples of which are also shown in FIG. 6. Ifthe quitting registry 516 is also an overlay node, it sends a Quitmessage to the RCE 600 that orchestrated the RON creation. The RCE 600will then replace the overlay node with another registry that supportsthe same IPDI as the one which is quitting. This latter functionality isillustrated by the three signals at the bottom of FIG. 6 (albeit theActivateNode message will likely be sent to a different overlay node(not shown) than the one which sent the Quit message). In the case of aJoin message from a “new” registry, a ConfigOvNode message is expectedas response from the RON 500, to insure that the overlay node is andthat it accepts the addition of the returning registry 516 to itsmulticast group.

To test the afore-described signaling frameworks, various simulationswere conducted. These involved measurements of, for example, twocharacteristics: network load and delay. Regarding network load, thenumber of messages which were transmitted associated with negotiating anetwork composition, for a participant and a mediator to quit thenegotiation, for RON creation and for a registry to join and quit theRON were measured and/or calculated. Delays were calculated in secondsand included measurement of the following types of delays: total timedelay for successful negotiation and for RON creation, averagepropagation time delay for successful negotiation, RON creation and fora virtual registry to quit the RON. Total time delay for successfulnegotiation is the total time delay required for the completenegotiation, i.e., the difference between the time when the initiator 30creates the first Initiate message, and the time when the mediatorreceives the last Ack for the agreement. These measurements do notinclude the delays for internal processing related to the negotiation(e.g., agreement creation).

Similarly, the total time delay for RON creation is the total time delayrequired for the complete RON creation, i.e., a difference between thetime when the RCE creates the first ActivateNode message and the timewhen the last registry receives a ConfigOvNode message. A differentActivateNode message, e.g., containing different information such as themulticast group members, is created for each virtual registry. Averagepropagation time delay is the average time delay for a single message toget from the source to the destination.

The composed network being simulated was composed of a number ofnetworks 700, each containing a Registry Composition Entity (RCE) 702,the functional entity responsible for registry composition, as shown inFIG. 7. The mediator 32 was modeled as a separate entity and was part ofone of the composing networks 700. During the simulation, the number ofcomposing networks 700 was varied (although three are shown in FIG. 7 asan example) and the scalability parameters were calculated for eachcase. In general, only a small number (e.g., 2 or 3) of networks willtypically compose with one another at a given time, e.g., since not allof the networks will move near to one another at the same time. Thesituation where a larger number of networks are composing can be seen asa number of successive composition sessions between a limited numbers ofnetworks. Thus in the following examples, the negotiation process hasbeen simulated for 2, 3, 5, 10, 15 and 20 entities.

From FIG. 2( a), it can be seen that, in order achieve a successfulnegotiation between two entities, 14 messages are needed (or 7 for thecase that the mediator is co-located with one of the entities). For eachextra entity involved in the process, 7 extra messages are needed.Therefore, the number (nbr) of exchanged messages between n entities ina successful negotiation is nbr=7n (or 7n-7 if the mediator isco-located with one of the entities). This is because the messaginglayer, on the mediator side, sends a copy of each outgoing message toeach of the group members. This formula was validated by the simulationresults (FIG. 8). To reduce the number of exchanged messages (nbr), amulticast solution can be utilized, which will duplicate messages onlywhen needed. FIG. 9 presents the average message propagation time delayin each of the six simulations and also presents the total time delayfor successful negotiation. The time delay is linearly proportional tothe number of composing net works, and it remains barely noticeable bythe client. The average time delay varies by less than 0.01 s (0.05 sfor total time delay) for each additional five networks. The total timeto complete negotiation between 20 ANs is less than 0.16 s.

The number of messages exchanged to allow an entity to quit thenegotiation according to this exemplary embodiment is two (i.e., a Byemessage followed by an Ok message). The total time delay needed for aparticipant to quit the negotiation is the time needed to exchange thosetwo messages (e.g., about 0.04 s in the case where 20 entities arenegotiating). This time remains negligible compared to the totalnegotiation time delay and the quitting process does not disturb toomuch the negotiation process among the remaining parties. However, incase of a mediator quitting the negotiation, the quitting time delaydepends on the amount of information to be exchanged between the new andthe quitting mediators.

FIG. 10 illustrates the network composition model used for simulatingthe agreement execution aspect of these exemplary embodiments. Thecomposed network 1000 hosts a given number of heterogeneous registries,which are organized into different multicast groups. The modeled RCE1002 is the entity that orchestrates the creation of the registryoverlay network, e.g., by activating a certain number of overlay nodes1004 each of which are associated with a certain number of registries1006. This simulation started with the case of two heterogeneousregistries (R1 and R2), where two overlay nodes (ON1 and ON2) areneeded. Then, the simulation parameters were varied, e.g., the number ofregistries was varied from 2 to 35 and the number of overlay nodes whichwere activated was varied from 2 to 7. The scalability parameters werethen measured for each permutation. For example, the average messagepropagation time delay (seen in FIG. 11) and the total time delayrequired for the complete RON creation (seen in FIG. 12) vary dependingon the number of registries in the network and the number of overlaynodes used. They are linearly proportional to the number of registries.However, for each different number of registries to be composed, it canbe seen that there are varying differences between average propagationtime delays when using different numbers of overlay nodes (e.g., forfive registries, the minimum average delay is obtained for 3 overlaynodes). This same characteristic is also seen for the total time delayin FIG. 12. This information can be used by exemplary embodiments tooptimally choose the number of registries to be served by the sameoverlay node, instead of using a single overlay node for all of theregistries using the same IPDI as the overlay node, independently oftheir number.

FIG. 13 shows the number (nbrmsg) of messages exchanged for agreementexecution in the simulations as a function of the number of registriesand the number of overlay nodes. It can be seen therein that, for eachnumber of registries (nbrreg), nbrmsg is the same independent of thenumber of overlay nodes. Indeed, in each case, the RCE 1002 sends asingle ActivateNode message to each overlay node 1004 (nbrovnodes), eachoverlay node 1004 sends nbrsame_regs ConfigOvNode messages, wherenbrsame_regs is the number of registries that have the same IPDI as theoverlay node. The message sent by an overlay node 1004 to itself (i.e.,since the overlay node 1004 also includes its own registry) is notcounted since it is not sent to the network.

For a registry 1006 to quit a RON 1004, only one message may be used(i.e., a Quit message sent to the overlay node 1004). The quittingprocess is transparent to the other entities in the network (except theoverlay node). When an overlay node decides to quit, more processing,messages and time are required. For example, when an overlay node 1004quits, the RCE 1002 should replace it, which is equivalent to creating aRON with one overlay node and (nbrisame_regs-1) registries.Nbrisame_regs is the number of registries served by the quitting node,including itself. FIG. 14 shows the average propagation and total timedelay for an overlay node 1004 to quit, where nbrisame_regs varies from2 to 20, along with the average propagation and total time delay for thecreation of the related RON.

The foregoing exemplary embodiments describe methods, systems, devicesand software for negotiating and executing registry composition. Anexemplary (hardware) node 1500 which may be involved in such activitiesis illustrated as FIG. 15. Therein, node 1500 contains a processor 1502(or multiple processor cores), memory 1504, one or more secondarystorage devices 1506 and an interface unit 1508 to facilitatecommunications between node 1500 and the rest of the network, e.g., aparticipant node or a mediator node during the negotiation phase ofnetwork composition or an overlay node associated with execution of anagreed-to composition as described above.

Thus, according to one exemplary embodiment, a method for executing anegotiated registry composition includes the steps shown in theflowchart of FIG. 16. Therein, at step 1600, a first message is receivedat an overlay node to activate that overlay node, the first message(e.g., an ActivateNode message) including a list of at least oneregistry that supports an interface (e.g., an IPDI) being used by theoverlay node. This message may be targeted to a specific overlay nodethat uses this specific interface (e.g., this IPDI), which specificoverlay node will be known to the RCE through previous processesassociated with the network composition. The overlay node then sends, asshown in step 1602, a second message (e.g., a ConfigOvNode message)toward a re-director module of each registry in the list.

According to another exemplary embodiment, a method for negotiatingregistry composition when a mediator leaves an ongoing negotiationincludes the steps illustrated in the flowchart of FIG. 17. Therein, anoffer is sent to compose registries from a mediator node to at least twoparticipant nodes at step 1700. Then, the mediator node terminates itsparticipation, at step 1702, in the negotiation prior to reaching aregistry composition agreement.

The present invention may, of course, be carried out in other specificways than those herein set forth without departing from the scope andessential characteristics of the invention. The present embodiments are,therefore, to be considered in all respects as illustrative and notrestrictive, and all changes coming within the meaning and equivalencyrange of the appended claims are intended to be embraced therein.

1. A method for executing a negotiated registry composition agreement,comprising: receiving a first message at an overlay node to activatesaid overlay node, said first message including a list of at least oneregistry that supports an interface being used by said overlay node; andsending, from said overlay node, a second message toward a re-directormodule of each of said at least one registry in said list.
 2. The methodof claim 1, further comprising: receiving, at said overlay node, a thirdmessage indicating that said registry wants to quit from a composedregistry associated with said overlay node.
 3. The method of claim 2,further comprising: receiving, at said overlay node, a fourth messageindicating that said registry wants to rejoin said composed registryassociated with said overlay node.
 4. The method of claim 1, whereinsaid registry is a database which contains data accessible by anapplication.
 5. The method of claim 1, wherein said interface is anInformation Publication and Discovery Interface (IPDI).
 6. The method ofclaim 1, further comprising: determining a number of overlay nodes toactivate based upon a number of registries to be composed.
 7. The methodof claim 6 wherein the step of determining a number of overlay nodes toactivate based upon a number of registries to be composed furthercomprising determining, for each of the registries, an interface beingused thereby.
 8. The method of claim 1, wherein said overlay nodefurther comprises: a signaling application, associated with a signalinglayer of said overlay node, for processing said first and secondmessages; and a group management module, associated with a messaginglayer of said overlay node and in communication with said signalingapplication, said group management module including: a create groupfunction for creating a communication group to enable messages to besent to a plurality of destinations; an add member function for adding anew member to said communication group; a remove member function forremoving a member from said communication group; and a change memberfunction for changing an IP address associated with a member of saidcommunication group.
 9. The method of claim 1, wherein said overlay nodefurther comprises: a signaling application, associated with a signalinglayer of said overlay node, for processing said first and secondmessages; and a messaging primitive module, associated with a messaginglayer of said overlay node, said messaging primitive module including: asend message primitive function for sending a message to one or moredestinations including a group identification parameter and a minimumresponse parameter indicating a minimum number of responses; and areceive message primitive function for processing messages received bysaid overlay node, and selectively passes said messages on to saidsignaling application when said minimum number of responses have beenreceived.
 10. A method for negotiating registry composition when amediator leaves an ongoing negotiation comprising: sending, from amediator node, an offer to compose registries to at least twoparticipant nodes; and terminating, by said mediator node, participationin said negotiation prior to reaching registry composition agreement.11. The method of claim 10, further comprising: establishing, by saidmediator node, a connection with one or more neighboring mediator nodes;and requesting, by said mediator node prior to terminating, that one ofsaid neighboring mediator nodes take over negotiation of said registrycomposition.
 12. The method of claim 10, further comprising: receiving,by said mediator node, heartbeat signals from at least one neighboring,mediator node; and replying, by said mediator node, to said heartbeatsignals until said terminating occurs.
 13. The method of claim 12,further comprising: replacing, by one of said at least one neighboringmediator nodes, said mediator node in said negotiation.
 14. Acommunication node comprising: a processor for executing a negotiatedregistry composition agreement by receiving a first message to activatean overlay node, said first message including a list of at least oneregistry that supports an interface being used by said overlay node; andby sending a second message toward a re-director module of each of saidat least one registry in said list.
 15. The communication node of claim14, wherein said processor receives a third message indicating that saidregistry wants to quit from a composed registry associated with saidoverlay node.
 16. The communication node of claim 15, wherein saidprocessor receives a fourth message indicating that said registry wantsto rejoin said composed registry associated with said overlay node. 17.The communication node of claim 14, wherein said registry is a databasewhich contains data accessible by an application.
 18. The communicationnode of claim 14, wherein said interface is an Information Publicationand Discovery Interface (IPDI).
 19. The communication node of claim 14,wherein said overlay node further comprises: a signaling application,associated with a signaling layer of said overlay node, for processingsaid first and second messages; and a group management module,associated with a messaging layer of said overlay node and incommunication with said signaling application, said group managementmodule including: a create group function for creating a communicationgroup to enable messages to be sent to a plurality of destinations; anadd member function for adding a new member to said communication group;a remove member function for removing a member from said communicationgroup; and a change member function for changing an IP addressassociated with a member of said communication group.
 20. Thecommunication node of claim 14, wherein said overlay node furthercomprises: a signaling application, associated with a signaling layer ofsaid overlay node, for processing said first and second messages; and amessaging primitive module, associated with a messaging layer of saidoverlay node, said messaging primitive module including: a send messageprimitive function for sending a message to one or more destinationsincluding a group identification parameter and a minimum responseparameter indicating a minimum number of responses; and a receivemessage primitive function for processing messages received by saidoverlay node, and selectively passes said messages on to said signalingapplication when said minimum number of responses have been received.21. A communication node which operates as a mediator for negotiatingregistry composition comprising: a processor for sending an offer tocompose registries to at least two participant nodes, and whichsubsequently decides to terminate its participation in said negotiationprior to reaching a registry composition agreement.
 22. Thecommunication node of claim 21, wherein said processor establishes aconnection with one or more neighboring mediator nodes and requests,prior to terminating, that one of said neighboring mediator nodes takeover negotiation of said registry composition.
 23. The communicationnode of claim 21, wherein said processor receives heartbeat signals fromat least one neighboring, mediator node, and replies to said heartbeatsignals until said terminating occurs.